Riemann-Hilbert factorizations and inverse scattering for the AKNS-equation with {$L\sp 1$}-potentials. I
نویسندگان
چکیده
منابع مشابه
Inverse scattering problem for the Impulsive Schrodinger equation with a polynomial spectral dependence in the potential
In the present work, under some di¤erentiability conditions on the potential functions , we rst reduce the inverse scattering problem (ISP) for the polynomial pencil of the Scroedinger equation to the corresponding ISP for the generalized matrix Scrödinger equation . Then ISP will be solved in analogy of the Marchenko method. We aim to establish an e¤ective algorithm for uniquely reconstructin...
متن کاملScattering and inverse scattering for the 1-D SchrOdinger equation witti energy-dependent potentials
The one-dimensional Schriidinger equation with a potential k2 V( X) proportional to energy is studied. This equation is equivalent to the wave equation with variable speed. When V(X) < 1, is bounded below, and satisfies two integrability conditions, the scattering matrix is obtained and its asymptotics for small and large energies are established. The inverse scattering problem of recovering V(...
متن کاملFactorizations, Riemann-Hilbert problems and the corona theorem
The solvability of the Riemann–Hilbert boundary value problem on the real line is described in the case when its matrix coefficient admits a Wiener–Hopf-type factorization with bounded outer factors, but rather general diagonal elements of its middle factor. This covers, in particular, the almost periodic setting, when the factorization multiples belong to the algebra generated by the functions...
متن کاملA Riemann–Hilbert Approach for the Novikov Equation
We develop the inverse scattering transform method for the Novikov equation ut − utxx + 4uux = 3uuxuxx + uuxxx considered on the line x ∈ (−∞,∞) in the case of non-zero constant background. The approach is based on the analysis of an associated Riemann–Hilbert (RH) problem, which in this case is a 3×3 matrix problem. The structure of this RH problem shares many common features with the case of ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications of the Research Institute for Mathematical Sciences
سال: 1993
ISSN: 0034-5318
DOI: 10.2977/prims/1195166423